An Iterative Mesh Untangling Algorithm Using Edge Flip
نویسندگان
چکیده
منابع مشابه
An improved iterative segmentation algorithm using canny edge detector for skin lesion border detection
One of the difficult problems recognized in image processing and pattern analysis, in particular in medical imaging applications is boundary detection. The detection of skin lesion boundaries accurately allows, skin cancer detection .There is no unified approach to this problem, which has been found to be application dependent. Early diagnosis of melanoma is a challenge, especially for general ...
متن کاملSpeckle Deconvolution Imaging Using An Iterative Algorithm
We present an application of an iterative deconvolution algorithm to speckle interferometric data. This blind deconvolution algorithm permits the recovery of the target distribution when the point spread function is either unknown or poorly known. The algorithm is applied to specklegrams of the multiple star systems, and the results for UMa are compared to shift-and-add results for the same dat...
متن کاملAn Iterative Method for Fast Mesh Denoising
A new approach for removing noises from a corrupted 3D model (mesh or surface) of arbitrary topology is presented. The basic idea is to transform a space domain model into a frequency-like domain representation and achieve denoising by low pass filtering. The transformation from space domain to frequency domain is done by decomposing the 3D model into an infinite series of meshes of the same to...
متن کاملMesh Simplification Using the Edge Attributes
This paper presents a novel technique for simplifying a triangulated surface at different levels of resolution. While most existing algorithms, based on iterative vertex decimation, employ the distance for error metric, the proposed algorithm utilizes an edge criterion for removing a vertex. An interior angle of a vertex is defined as the maximum value of all possible angles formed by combinati...
متن کاملRestricted Mesh Simplification Using Edge Contractions
We consider the problem of simplifying a planar triangle mesh using edge contractions, under the restriction that the resulting vertices must be a subset of the input set. That is, contraction of an edge must be made onto one of its adjacent vertices, which results in removing the other adjacent vertex. We show that if the perimeter of the mesh consists of at most five vertices, then we can alw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2017
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2017/2953736